Queue
Operates on a First In, First Out (FIFO) principle
Stack
Operates on a Last In, Last Out (LIFO) principle
Bubble Sort
Bubble Sort Visualizer
Selection Sort
Selection Sort Visualizer
Merge Sort
Merge Sort Visualizer
Sliding Window Sort
Sliding Window Visualizer
Binary Search
Binary Search Visualizer
Linked List
Linked List Visualizer
Quick Sort
Quick Sort Visualizer
Two Pointer Sort
Two Pointer Visualizer
Sieve of Eratosthenes
Sieve of Eratosthenes Visualizer
Quick Sort Visualization
OVERVIEW
QuickSort is a sorting algorithm based on the Divide and Conquer that picks an element as a pivot and partitions the given array around the picked pivot by placing the pivot in its correct position in the sorted array.
Time Complexity
Best Case: O(nlogn) (Pivot divides array evenly).
Average Case: O(nlogn) (Random Pivot)
Worst Case: O(n2)(Sorted/Reverse sorted with bad pivot).
Color Representation
Red → Default color for unsorted elements.
Lightcoral → Highlights the chosen pivot element
Orange → Indicates movement of the left pointer
Cyan → Indicates movement of the right pointer
Green → Marks elements in their final sorted position